State transition machines for lambda calculus expressions
نویسنده
چکیده
The process of compiler generation from lambda-calculus definitions is studied. The compiling schemes developed utilize as their object language the set of state transition machines (STMs): automata-like transition sets using firstorder arguments. An intermediate definition form, the STM-interpreter, is treated as central to the formulation of STMs. Three compiling schemes are presented: one derived directly from an STM-interpreter for the lambda-calculus; one formulated from an STM-interpreter variant of Landin’s SECD-machine; and one defined through meaning-preserving transformations upon a denotational definition of the lambda-calculus. The results are compared and some tentative conclusions are made regarding the utility of compiler generation with the STM forms.
منابع مشابه
State-transition machines, revisited
In the autumn of 1978, Neil Jones and Steve Muchnick, working at the University of Kansas, were studying compiler synthesis from Scott-Strachey denotational-semantics definitions; I was Neil’s student. Neil read intently John Reynolds’s 1972 paper, Definitional Interpreters for Higher-Order Programming Languages [14], and applied Reynolds’s continuation-passing and defunctionalization transform...
متن کاملBisimulation is Not Finitely (First Order) Equationally Axiomatisable
This paper considers the existence of nite equational axiomatisations of bisimulation over a calculus of nite state processes. To express even simple properties such as XE = XE[E=X] equationally it is necessary to use some notation for substitutions. Accordingly the calculus is embedded in a simply typed lambda calculus, allowing axioms such as the above to be written as equations of higher typ...
متن کاملTowards an Action Re nement
Reenement is the process of deriving speciications on a lower level of abstraction from those on a higher level. A reenement calculus for Abstract State Machines allowing to derive action speciications from another { preserving the semantics of the abstract speciication { will be outlined. Abstract state machines are rephrased as objects with local state. These objects are the structures in whi...
متن کاملA Study of Syntactic and Semantic Artifacts and its Application to Lambda Definability, Strong Normalization, and Weak Normalization in the Presence of State
Church’s lambda-calculus underlies the syntax (i.e., the form) and the semantics (i.e., the meaning) of functional programs. This thesis is dedicated to studying man-made constructs (i.e., artifacts) in the lambda calculus. For example, one puts the expressive power of the lambda calculus to the test in the area of lambda definability. In this area, we present a course-of-value representation b...
متن کاملASM and Operational Algorithmic Completeness of Lambda Calculus
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family of computable functions (taken as primitive tools, i.e., kind of oracle functions for the algorithm), for every constant K big enough, each computation step ...
متن کامل